A medical network clustering method with weighted graph structure
نویسندگان
چکیده
منابع مشابه
Weighted Graph Clustering with Non-Uniform Uncertainties
We study the graph clustering problem where each observation (edge or no-edge between a pair of nodes) may have a different level of confidence/uncertainty. We propose a clustering algorithm that is based on optimizing an appropriate weighted objective, where larger weights are given to observations with lower uncertainty. Our approach leads to a convex optimization problem that is efficiently ...
متن کاملWeighted Graph Clustering with Non-Uniform Uncertainties
ij b0 almost surely for all i, j and the condition (6) holds, then with high probability, we have kW E [W ]k c2 ⇣ b log n+ p ⇢n log n ⌘ (12) and UU> (W E [W ]) 1 c3 p b2 log n+ ⇢K log n K (13) for some universal constants c2, c3. We prove the lemma in Section 7.1.1 to follow. We now prove Theorem 1 assuming the two inequalities (12) and (13) in the lemma hold. For any matrix Y , we define...
متن کاملWeighted Graph Compression for Parameter-free Clustering With PaCCo
Object similarities are now more and more characterized by connectivity information available in form of network or graph data. Complex graph data arises in various fields like e-commerce, social networks, high throughput biological analysis etc. The generated interaction information for objects is often not simply binary but rather associated with interaction strength which are in turn represe...
متن کاملWeighted Optimal Path in Graph with Multiple Indexes
This paper represents a technique for finding optimal paths with multiple indexes in a graph. Up to the present time, all optimal paths have been determined upon one index, say, distance for which an evaluation method exists. In this paper firstly we define multiple indexes for each edge in such a way that anyone can treat the factor for assigning an optimal path. Here, we use Data Envelopment ...
متن کاملA Novel Molecular Descriptor Derived from Weighted Line Graph
The Bertz indices, derived by counting the number of connecting edges of line graphs of a molecule were used in deriving the QSPR models for the physicochemical properties of alkanes. The inability of these indices to identify the hetero centre in a chemical compound restricted their applications to hydrocarbons only. In the present work, a novel molecular descriptor has been derived from the w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Measurement and Control
سال: 2020
ISSN: 0020-2940
DOI: 10.1177/0020294020952469